Resurrecting the Asymptotics of Linear Recurrences *
نویسنده
چکیده
Once on the forefront of mathematical research in America, the asymptotics of the solutions of linear recurrence equations is now almost forgotten, especially by the people who need it most, namely combinatorists and computer scientists. Here we present this theory in a concise form and give a number of examples that should enable the practicing combinatorist and computer scientist to include this important technique in her (or his) asymptotics tool kit. X” 1985 Academic Press, Inc
منابع مشابه
Asymptotics of Linear Recurrences with Rational Coeecients Asymptotics of Linear Recurrences with Rational Coeecients Asymptotics of Linear Recurrences with Rational Coeecients
We give algorithms to compute the asymptotic expansion of solutions of linear recurrences with rational coeecients and rational initial conditions in polynomial time in the order of the recurrence. Asymptotique des r ecurrences lin eaires a coeecients rationnels R esum e Nous pr esentons des algorithmes pour le calcul du d eveloppement asymptotique des solutions de r ecurrences lin eaires a coe...
متن کاملEeective Asymptotics of Linear Recurrences with Rational Coeecients
We give algorithms to compute the asymptotic expansion of solutions of linear recurrences with rational coeecients and rational initial conditions in polynomial time in the order of the recurrence.
متن کاملAsymptotics of linear divide-and-conquer recurrences
Asymptotics of divide-and-conquer recurrences is usually dealt either with elementary inequalities or with sophisticated methods coming from analytic number theory. Philippe Dumas proposes a new approach based on linear algebra. The example of the complexity of Karatsuba’s algorithm is used as a guide in this summary. The complexity analysis of divide-and-conquer algorithms gives rise to recurr...
متن کاملDiophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملOn Asymptotics of Certain Recurrences Arising
Ramanujan's Q-function and the so called \tree function" T(z) deened implicitly by the equation T(z) = ze T(z) found applications in hashing, the birthday paradox problem, random mappings, caching, memory connicts, and so forth. Recently, several novel applications of these functions to information theory problems such as linear coding and universal portfolios were brought to light. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1985